Network traffic behaviour near phase transition point
نویسندگان
چکیده
منابع مشابه
Phase transition in a directed traffic flow network.
The generic feature of traffic in a network of flowing electronic data packets is a phase transition from a stationary free-flow phase to a continuously growing congested nonstationary phase. In the most simple network of directed oriented square lattice we have been able to observe all crucial features of such flow systems having nontrivial critical behavior near the critical point of transiti...
متن کاملNetwork Traffic Behaviour in Switched Ethernet Systems
Measurements on a high-performance Ethernet are shown to match well a truncated Cauchy probability distribution, with a much better fit over smaller file/request sizes than the commonly used Pareto distribution. We observe self similar characteristics in the traffic at both file servers and at a CPU server elsewhere in the network, which targets, predominantly, file and web servers. This sugges...
متن کاملCritical behaviour of second sound near the smectic A nematic phase transition
2014 We show that the smectic A compressional elastic constant, measured in the (100 kHz, q ~ a few 102 cm-1) range exhibits a critical behaviour consistent with either the helium analogy (8 CB) or the proximity of a tricritical point (8 OCB). The extreme anisotropy of the second sound propagation velocity is also established in a range not accessible previously. J. Physique 42 (1981) 861-873 J...
متن کاملPhase-transition-like behaviour of quantum games
The discontinuous dependence of the properties of a quantum game on its entanglement has been shown to be very much like phase transitions viewed in the entanglement-payoffdiagram (J Du et al 2002 Phys. Rev. Lett. 88 137902). In this paper we investigate such phase-transition-like behaviour of quantum games, by suggesting a method which would help to illuminate the origin of such a kind of beha...
متن کاملPhase transition behaviour in constraint satisfaction problems
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment for every variable such that no constraints are violated. Most forms of CSP are NP-complete. Recent research has shown that the CSP exhibits a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2006
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2006-00141-x